On the design of rate-compatible serially concatenated convolutional codes
نویسندگان
چکیده
A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. In this paper, this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer chart analysis to improve performance in the waterfall region. Following this approach, we construct a family of rate-compatible SCCCs with low complexity and good performance in both the error floor and the waterfall regions over a broad range of code rates. The performance of the proposed codes is found to compare favorably to standard SCCCs and PCCCs. The proposed codes outperform standard SCCCs and have a similar performance as more complex PCCCs. The proposed codes perform particularly well for high code rates.
منابع مشابه
Design of Rate-Compatible Serially Concatenated Convolutional Codes
Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer charts analysis. Following this approach, we construct a family o...
متن کاملAnalysis, Design, and Iterative Decoding of Double Serially Concatenated Codes with Interleavers
A double serially concatenated code with two interleaves consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits and an inner encoder whose input words are the permuted middle codewords. The construction can be generalized to h cascaded encoders separated by h – 1 interleavers, where ...
متن کاملOn the Distance Growth Properties of Double Serially Concatenated Convolutional Codes
It has recently been shown that the minimum distance of the ensemble of repeat multiple accumulate codes grows linearly with block length. In this paper we present a method to obtain the minimum distance growth rate coefficient of double-serially concatenated codes and determine the growth coefficient of the rate 1/2 double serially concatenated code consisting of an outer memory-one convolutio...
متن کاملHybrid Concatenated Codes and Iterative Decoding
A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...
متن کاملOn the Design of Double Serially Concatenated Codes with an Outer Repetition Code
Motivated by the recent discovery that repeat-accumulate-accumulate (RAA) codes with a repetition factor of three or larger are asymptotically good, we focus on the design of double-serially concatenated codes (DSCCs) with an outer repetition code. The main design goal is to obtain rate-1/2 codes with minimum distance approaching the Gilbert-Varshamov bound (GVB), while still maintaining a good...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Transactions on Telecommunications
دوره 18 شماره
صفحات -
تاریخ انتشار 2007